Partitioning a rectangle into small perimeter rectangles
نویسندگان
چکیده
منابع مشابه
Partitioning a rectangle into small perimeter rectangles
Alon, N. and D.J. Kleitman, Partitioning a rectangle into small perimeter rectangles, Discrete Mathematics 103 (1992) 111-119. We show that the way to partition a unit square into kZ + s rectangles, for s = 1 or s = -1, so as to minimize the largest perimeter of the rectangles, is to have k 1 rows of k identical rectangles and one row of k + s identical rectangles, with all rectangles having th...
متن کاملThe Decomposition of a Rectangle into Rectangles of Minimal Perimeter
We solve the problem of decomposing a rectangle R into p rectangles of equal area so that the maximum rectangle perimeter is as small as possible. This work has applications in areas such as flexible object packing and data allocation. Our solution requires only a constant number of arithmetic operations and integer square roots to characterize the decomposition, and linear time to print the de...
متن کاملCovering a Square by Small Perimeter Rectangles
We show that if the unit square is covered by n rectangles, then at least one must have perimeter at least 4(2m + 1)/(n + m(m + 1)), where m is the largest integer whose square is at most n. This result is exact for n of the form m(m + 1) (or m2).
متن کاملAn effective recursive partitioning approach for the packing of identical rectangles in a rectangle
In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heur...
متن کاملA Polynomial Algorithm of Optimum Cutting a Rectangle into Rectangles with Two Heights
We consider the problem of guillotine cutting a rectangular sheet into rectangular pieces with two heights. A polynomial time algorithm for this problem is constructed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90261-d